The security of the algorithm is analyzed from the randomness , linear complexity of the chaotic sequence and the intensity of initial key . the results show the randomness of the key sequence pass the frequency test , sequential test , poker test , autocorrelation test , runs test , etc . and the total level is better than the binary sequence generated by the prng of delphi 7 . 0 , logistic chaotic system and rc4 , the linear complexity comes up to the expectation , the initial key has very strong intensity 本文最后從混沌序列的隨機性、線性復(fù)雜度和初始密鑰的強度三個方面對算法進行了安全性分析,結(jié)果表明算法產(chǎn)生的密鑰序列的隨機性完全通過了頻數(shù)檢驗、序列檢驗、撲克檢驗、自相關(guān)檢驗和游程檢驗等5種統(tǒng)計檢驗方法的檢驗,而且整體水平要好于delphi7 . 0中的偽隨機數(shù)發(fā)生器、 logistic混沌系統(tǒng)和rc4三種方法產(chǎn)生的二進制序列,線性復(fù)雜度達到了數(shù)學期望值。